Configurable Alert Delivery In A Distributed Processing System

ABSTRACT

Methods, systems, and computer program products for configurable alert delivery in a distributed processing system are provided. Embodiments include for each alert generated by an incident analyzer, applying, by the incident analyzer, active alert filters to the alert; wherein applying the active alert filters to the alert includes: creating, by the incident analyzer, a list of all active alert filters and a set of all active listeners; and for each active alert filter, running, by the incident analyzer, the active alert filter; if the active alert filter indicates that the alert should not go to one or more of the active listeners, removing, by the incident analyzer, the one or more active listeners from the set of all active listeners; if the active listeners set is empty, stopping, by the incident analyzer, processing of the alert; and if the active listeners set is not empty, selecting, by the incident analyzer, the next active alert filter from the active alert filter list.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The field of the invention is data processing, or, more specifically,methods, systems, and products for configurable alert delivery in adistributed processing system.

2. Description of Related Art

The development of the EDVAC computer system of 1948 is often cited asthe beginning of the computer era. Since that time, computer systemshave evolved into extremely complicated devices. Today's computers aremuch more sophisticated than early systems such as the EDVAC. Computersystems typically include a combination of hardware and softwarecomponents, application programs, operating systems, processors, buses,memory, input/output devices, and so on. As advances in semiconductorprocessing and computer architecture push the performance of thecomputer higher and higher, more sophisticated computer software hasevolved to take advantage of the higher performance of the hardware,resulting in computer systems today that are much more powerful thanjust a few years ago.

Modern distributed processing systems for intensive computing may havemillions of devices with many processes running on each device all ofwhich are capable of error and status reporting for automated errorrecovery, reporting to a systems administrator, and for other reasons.In many cases, in the case of an error for example, the sheer number ofsuch error reports and status reports are so overwhelming that theycannot be handled in a meaningful manner. For example, a systemsadministrator receiving a hundred thousand error reports may beoverwhelmed by the sheer number of such reports and therefore in theaggregate those reports become more and more unhelpful and irrelevant.

SUMMARY OF THE INVENTION

Methods, systems, and computer program products for configurable alertdelivery in a distributed processing system are provided. Embodimentsinclude for each alert generated by an incident analyzer, applying, bythe incident analyzer, active alert filters to the alert; whereinapplying the active alert filters to the alert includes: creating, bythe incident analyzer, a list of all active alert filters and a set ofall active listeners; and for each active alert filter, running, by theincident analyzer, the active alert filter; if the active alert filterindicates that the alert should not go to one or more of the activelisteners, removing, by the incident analyzer, the one or more activelisteners from the set of all active listeners; if the active listenersset is empty, stopping, by the incident analyzer, processing of thealert; and if the active listeners set is not empty, selecting, by theincident analyzer, the next active alert filter from the active alertfilter list.

The foregoing and other objects, features and advantages of theinvention will be apparent from the following more particulardescriptions of exemplary embodiments of the invention as illustrated inthe accompanying drawings wherein like reference numbers generallyrepresent like parts of exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an exemplary system for configurable alert deliveryin a distributed processing system according to embodiments of thepresent invention.

FIG. 2 sets forth a block diagram of automated computing machinerycomprising an exemplary computer useful in administering event pools forrelevant event analysis according to embodiments of the presentinvention.

FIG. 3 sets forth a block diagram of an exemplary system forconfigurable alert delivery in a distributed processing system accordingto embodiments of the present invention.

FIG. 4 sets forth a diagram illustrating assigning events to an eventpool according to embodiments of the present invention.

FIG. 5 sets forth a diagram illustrating assigning alerts to an alertpool according to embodiments of the present invention.

FIG. 6 sets forth a flow chart illustrating an example method ofadministering event pools for relevant event analysis according toembodiments of the present invention.

FIG. 7 sets forth a flow chart illustrating an exemplary method ofconfigurable alert delivery in a distributed processing system accordingto embodiments of the present invention.

FIG. 8 sets forth a flow chart illustrating another exemplary method ofconfigurable alert delivery in a distributed processing system accordingto embodiments of the present invention.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Exemplary methods, systems, and computer program products forconfigurable alert delivery in a distributed processing system andaccording to embodiments of the present invention are described withreference to the accompanying drawings, beginning with FIG. 1. FIG. 1illustrates an exemplary system for configurable alert delivery in adistributed processing system according to embodiments of the presentinvention. A distributed processing system is typically implemented asmultiple autonomous or semi-autonomous computers that communicatethrough a computer network. In such example distributed processingsystems, the computers often interact with each other in order toachieve a common goal. A computer program that runs in such an exampledistributed system is typically called a distributed program, anddistributed programming is often used to describe the process of writingsuch programs.

In the example of FIG. 1, the distributed processing system (101) isimplemented as a parallel computer (100), non-volatile memory for thecomputer in the form of data storage device (118), an output device forthe computer in the form of printer (120), and an input/output devicefor the computer in the form of computer terminal (122). The parallelcomputer (100) in the example of FIG. 1 also includes a plurality ofcompute nodes (102). Each compute node is an automated computing devicecomposed of one or more computer processors, its own computer memory,and its own input/output functionality. The compute nodes (102) arecoupled for data communications by several independent datacommunications networks including a high speed Ethernet network (174), aJoint Test Action Group (‘JTAG’) network (104), a tree network (106)which is optimized for collective operations, and a torus network (108)which is optimized for point to point operations. Tree network (106) isa data communications network that includes data communications linksconnected to the compute nodes so as to organize the compute nodes as atree. Each data communications network is implemented with datacommunications links among the compute nodes (102). The datacommunications links provide data communications for parallel operationsamong the compute nodes of the parallel computer. In addition to computenodes, computer (100) includes input/output (‘I/O’) nodes (110, 114)coupled to compute nodes (102) through one of the data communicationsnetworks (174). The I/O nodes (110, 114) provide I/O services betweencompute nodes (102) and I/O devices (118, 120, and 122). I/O nodes (110,114) are connected for data communications through local area network(‘LAN’) (130). Computer (100) also includes a service node (116) coupledto the compute nodes through one of the networks (104). Service node(116) provides service common to pluralities of compute nodes, loadingprograms into the compute nodes, starting program execution on thecompute nodes, retrieving results of program operations on the computernodes, and so on. Service node (116) runs an event and alert analysismodule (124) and communicates with users (128) through a serviceapplication interface (126) that runs on computer terminal (122).

Many of the components of the distributed processing system of FIG. 1,that is the devices of the distributed processing system or processesrunning on the devices of the distributed processing system of FIG. 1are capable of some form of error or status reporting through events andmany of such components are also capable of receiving alerts in responseto one or more of such events. Often in distributed processing systemsuseful according to embodiments of the present invention hundreds ofthousands or millions of components may provide incidents, often in theform of events or receive alerts.

An incident is a generic term used in this specification to mean anidentification or notification of a particular occurrence on a componentof a distributed processing system such as events described below, arefined identification of an occurrence often based on events such as analert described below, or other notifications as will occur to those ofskill in the art.

Incidents are administered in pools for event and alert analysisaccording to embodiments of the present invention. A pool of incidentsis a collection of incidents organized by the time of either theiroccurrence, by the time they are logged in an incident queue, includedin the pool, or other time as will occur to those of skill in the art.

The service node (116) of FIG. 1 has installed upon it an event andalert analysis module (124) that includes at least two incidentanalyzers implemented as events analyzers and alerts analyzers capableof configurable alert delivery in a distributed processing system (101)according to embodiments of the present invention. The event and alertanalysis module (124) is implemented as automated computing machinerycapable of for each alert generated by the incident analyzer, applying,by the incident analyzer, active alert filters to the alert; whereinapplying the active alert filters to the alert includes: creating, bythe incident analyzer, a list of all active alert filters and a set ofall active listeners; and for each active alert filter, running, by theincident analyzer, the active alert filter; if the active alert filterindicates that the alert should not go to one or more of the activelisteners, removing, by the incident analyzer, the one or more activelisteners from the set of all active listeners; if the active listenersset is empty, stopping, by the incident analyzer, processing of thealert; and if the active listeners set is not empty, selecting, by theincident analyzer, the next active alert filter from the active alertfilter list.

In some embodiments the unsuppressed alerts are transmitted to one ormore components of the distributed processing system. One such componentmay be a terminal (122) for display to a systems administrator. Othercomponents may include a component that generated an event, a componentfor error reporting, a component for automated error recovery or anyother component that will occur to those of skill in the art.

The event and alert module (124) of FIG. 1 allows the number ofincidents occurring such as events received and alerts produced at anygiven time to be less overwhelming to a systems administrator (128)attempting to identify a problem or occurrence in the distributedprocessing system. Administering event pools for relevant event analysisaccording to embodiments of the present invention provide alerts thatare more meaningful to a user in determining how to administer thefunctions and errors associated with a distributed processing system.

The arrangement of nodes, networks, and I/O devices making up theexemplary distributed processing system illustrated in FIG. 1 are forexplanation only, not for limitation of the present invention.Distributed data processing systems capable of administering event poolsfor relevant event analysis according to embodiments of the presentinvention may include additional nodes, networks, devices, andarchitectures, not shown in FIG. 1, as will occur to those of skill inthe art. The parallel computer (100) in the example of FIG. 1 includessixteen compute nodes (102); parallel computers capable of relevantalert delivery according to embodiments of the present inventionsometimes include thousands of compute nodes. In addition to Ethernetand JTAG, networks in such data processing systems may support many datacommunications protocols including for example TCP (Transmission ControlProtocol), IP (Internet Protocol), and others as will occur to those ofskill in the art. Various embodiments of the present invention may beimplemented on a variety of hardware platforms in addition to thoseillustrated in FIG. 1.

Administering event pools for relevant event analysis in accordance withthe present invention is generally implemented with computers, that is,with automated computing machinery. In the system of FIG. 1, forexample, all the service nodes, I/O nodes, compute nodes, of theparallel computer are implemented to some extent at least as computers.For further explanation, therefore, FIG. 2 sets forth a block diagram ofautomated computing machinery comprising an exemplary computer (152)useful in relevant alert delivery according to embodiments of thepresent invention. The computer (152) of FIG. 2 includes at least onecomputer processor (156) or ‘CPU’ as well as random access memory (168)(‘RAM’) which is connected through a high speed memory bus (166) and busadapter (158) to processor (156) and to other components of the computer(152) and through an expansion bus to adapters for communications withother components of a distributed processing system (101).

Stored in RAM (168) is an event and alert analysis module (124), amodule of automated computing machinery for relevant alert deliveryaccording to embodiments of the present invention. The event and alertanalysis module (124) includes two alert analyzers (218) according toembodiments of the present invention. The alert analyzers (218) includean event analyzer (208) and an alert analyzer (218). The event analyzerof FIG. 2 is a module of automated computing machinery capable ofidentifying alerts in dependence upon received events. That is, eventanalyzers typically receive events and produce alerts. In manyembodiments, a plurality of event analyzers are implemented in parallel.Often such event analyzers are assigned to a particular pool of eventsand may be focused on events from a particular component or caused by aparticular occurrence to produce a more concise set of alerts.

The alert analyzer of FIG. 2 is a module of automated computingmachinery capable of identifying alerts for transmission from events andother alerts, identifying additional alerts for transmission, andsuppressing unnecessary, irrelevant, or otherwise unwanted alertsidentified by the event analyzer. That is, alert analyzers typicallyreceive alerts and events and produce or forward alerts in dependenceupon those alerts and events. In many embodiments, a plurality of alertanalyzers are implemented in parallel. Often such alert analyzers areassigned to a particular pool of alerts and may be focused on alertswith particular attributes to produce a more concise set of alerts.

The event analyzer (208) and the alert analyzer are each capable ofconfigurable alert delivery in a distributed processing system accordingto embodiments of the present invention. The event analyzer administerspools of events according to embodiments of the present invention byassigning, by an events analyzer, a plurality of events to an eventspool; determining, by an events analyzer in dependence upon the eventanalysis rules, to temporarily suppress events having particularattributes; determining, by an events analyzer, a duration for thesuppression of the events; and suppressing, by an events analyzer, eachevent assigned to the pool having the particular attributes for thedetermined duration.

The event and alert analysis module (124) of FIG. 2 includes computerprogram instructions for receiving in an event queue a plurality ofevents from one or more components (for example, 100, 182, 181, 180, and170) of a distributed processing system (101); assigning by the eventanalyzer (208) each received event to an events pool; identifying by theevent analyzer (208) in dependence upon the event arrival rules and theevents assigned to the events pool one or more alerts; closing, by theevent analyzer (208) in dependence upon the events pool operation rules,the events pool; determining, by the events analyzer (208) in dependenceupon the event suppression rules, whether to suppress one or more eventsin the closed events pool; identifying by the event analyzer (208) independence upon the events pool closure rules and any unsuppressedevents assigned to the events pool, one or more additional alerts;sending by the event analyzer (208) to the alert analyzer (218) all thealerts identified by the event analyzer; assigning by the alert analyzer(218) the identified alerts to an alerts pool; determining by the alertanalyzer (218) in dependence upon alert analysis rules and the alerts inthe alert pool whether to suppress any alerts; and transmitting (420)the unsuppressed alerts to one or more components of the distributedprocessing system.

Also stored in RAM (168) is an operating system (154). Operating systemsuseful for relevant alert delivery according to embodiments of thepresent invention include UNIX™ Linux™ Microsoft XP™ AIX™ IBM's i5/OS™and others as will occur to those of skill in the art. The operatingsystem (154), event and alert analysis module (124), the event analyzer(208), the alert analyzer (218) in the example of FIG. 2 are shown inRAM (168), but many components of such software typically are stored innon-volatile memory also, such as, for example, on a disk drive (170).

The computer (152) of FIG. 2 includes disk drive adapter (172) coupledthrough expansion bus (160) and bus adapter (158) to processor (156) andother components of the computer (152). Disk drive adapter (172)connects non-volatile data storage to the computer (152) in the form ofdisk drive (170). Disk drive adapters useful in computers for relevantalert delivery according to embodiments of the present invention includeIntegrated Drive Electronics (‘IDE’) adapters, Small Computer SystemInterface (‘SCSI’) adapters, and others as will occur to those of skillin the art. Non-volatile computer memory also may be implemented for asan optical disk drive, electrically erasable programmable read-onlymemory (so-called ‘EEPROM’ or ‘Flash’ memory), RAM drives, and so on, aswill occur to those of skill in the art.

The example computer (152) of FIG. 2 includes one or more input/output(‘I/O’) adapters (178). I/O adapters implement user-orientedinput/output through, for example, software drivers and computerhardware for controlling output to display devices such as computerdisplay screens, as well as user input from user input devices (181)such as keyboards and mice. The example computer (152) of FIG. 2includes a video adapter (209), which is an example of an I/O adapterspecially designed for graphic output to a display device (180) such asa display screen or computer monitor. Video adapter (209) is connectedto processor (156) through a high speed video bus (164), bus adapter(158), and the front side bus (162), which is also a high speed bus.

The exemplary computer (152) of FIG. 2 includes a communications adapter(167) for data communications with other computers (182) and for datacommunications with a data communications network (100). Such datacommunications may be carried out serially through RS-232 connections,through external buses such as a Universal Serial Bus (USW), throughdata communications data communications networks such as IP datacommunications networks, and in other ways as will occur to those ofskill in the art. Communications adapters implement the hardware levelof data communications through which one computer sends datacommunications to another computer, directly or through a datacommunications network. Examples of communications adapters useful forrelevant alert delivery according to embodiments of the presentinvention include modems for wired dial-up communications, Ethernet(IEEE 802.3) adapters for wired data communications networkcommunications, and 802.11 adapters for wireless data communicationsnetwork communications.

For further explanation, FIG. 3 sets forth a block diagram of anexemplary system for configurable alert delivery in a distributedprocessing system (102) according to embodiments of the presentinvention. The system of FIG. 3 includes an event and alert analysismodule (124). The event and alert analysis module (124) of FIG. 3receives in an event queue (206) a plurality of events (202) from one ormore components of a distributed processing system (102). A component ofa distributed processing system according to embodiments of the presentinvention may be a device of the distributed processing system or aprocess running on a device of the distributed processing. Suchcomponents are often capable of some form event transmission, often forerror or status reporting.

An event according to embodiments of the present invention is anotification of a particular occurrence in or on a component of thedistributed processing system. Such events are sent from the componentupon which the occurrence occurred or another reporting component to anevent and alert analysis module according to the present invention.Often events are notifications of errors occurring in a component of thedata processing system. Events are often implemented as messages eithersent through a data communications network or shared memory. Typicalevents for event and alert analysis according to embodiments of thepresent invention an occurred time, a logged time, an event type, anevent ID, a reporting component, and a source component, and otherattributes. An occurred time is the time at which the event occurred onthe component. A logged time is the time the event was included in theevent queue (206) and is typically inserted into the event by themonitor (204) in the example of FIG. 3. An event type is a generic typeof event such as for example, power error, link failure error, errorsrelated to not receiving messages or dropping packets and so on as willoccur to those of skill in the art. An event ID is a uniqueidentification of the event. A reporting component is an identificationof the component that reported the event. A source component is anidentification of the component upon which the event occurred. In manycases, but not all, the reporting component and source component are thesame component of the distributed processing system.

In the example of FIG. 3, the event and alert analysis module (124)includes a monitor (204) that receives events from components of thedistributed processing system and puts the received events (202) in theevent queue (206). The monitor (204) of FIG. 3 may receive events fromcomponents of the distributed processing system on their motion, mayperiodically poll one or more of the components of the distributedprocessing system, or receive events from components in other ways aswill occur to those of skill in the art.

They system of FIG. 3 includes an event analyzer (208). The eventanalyzer (208) of FIG. 3 is a module of automated computing machinerycapable of identifying alerts in dependence upon received events. Thatis, event analyzers typically receive events and produce alerts. In manyembodiments, a plurality of event analyzers are implemented in parallel.Often event analyzers are assigned to a particular pool of events andmay be focused on events from a particular component or caused by aparticular occurrence to produce a more concise set of alerts.

The event analyzer (208) of FIG. 3 assigns each received event (202) toan events pool (212). An events pool (212) is a collection of eventsorganized by the time of either their occurrence, by the time they arelogged in the event queue, included in the events pool, or other time aswill occur to those of skill in the art. That is, event pools are acollection of events organized by time. Such events pools often providethe ability to analyze a group of time related events identify alerts independence upon them. Often such event pools are useful in identifyingfewer and more relevant alerts in dependence upon multiple relatedevents.

The events pool (212) is administered by the event analyzer (208)according to embodiments of the present invention. The event analyzeradministers pools of events according to embodiments of the presentinvention by receiving, by the event analyzer from the event queue, aplurality of events from one or more components of the distributedprocessing system; creating, by the event analyzer, a pool of events,the pool having a predetermined initial period of time; assigning, bythe event analyzer, each received event to the pool; assigning, by theevent analyzer, to each event a predetermined minimum time for inclusionin a pool; extending, by the event analyzer, for one or more of theevents the predetermined initial period of time of the pool by aparticular period of time assigned to the event; determining, by theevent analyzer, whether conditions have been met to close the pool; andif conditions have been met to close the pool, determining for eachevent in the pool whether the event has been in the pool for itspredetermined minimum time for inclusion in a pool; and if the event hasbeen in the pool for us predetermined minimum time, including the eventin the closed pool; and if the event has not been in the pool for itspredetermined minimum time, evicting the event from the closed pool andincluding the event in a next pool.

As mentioned an events pool according to the method of FIG. 3 has apredetermined initial period of time and in the example of FIG. 3assigning by the event analyzer each received event to an events poolincludes extending for each event assigned to the events pool thepredetermined initial period of time by a particular period of timeassigned to the event. In this manner, the pool is extended with eachreceived event until a collection of events that may be usefully used toidentify alerts is assigned to the events pool.

As mentioned above, in some embodiments of the present invention, morethan one event analyzer may operate in parallel. As such, each eventanalyzer may maintain one or more event pools for relevant alertdelivery according to embodiments of the present invention. Assigning bythe event analyzer the events to an events pool may therefore includeselecting only events from one or more particular components. In suchembodiments, particular components may be selected for a particularevents pool to provide events associated with a particular period oftime from a particular set of one or more components.

Assigning by the event analyzer the events to an events pool may also becarried out by selecting only events of a particular event type. In suchembodiments, particular events may be selected for a particular eventspool to provide events associated with a particular period of time froma particular set of event types.

Event analyzer (208) in the example of FIG. 3 identifies in dependenceupon the event analysis rules (210) and the events assigned to theevents pool one or more alerts (214). Event analyses rules (210) are acollection of predetermined rules for meaningfully parsing receivedevents to identify relevant alerts in dependence upon the events.

The event analysis rules (210) of FIG. 3 include event arrival rules(230), events pool operation rules (232), event suppression rules (234),and events pool closure rules (236). Event arrival rules (230) areconfigurable predetermined rules for identifying alerts in dependenceupon events in real time as those events are assigned to the eventspool. That is, event arrival rules (230) identify alerts in dependenceupon events before closing the events pool. Such rules are typicallypredetermined to identify particular alerts in dependence uponattributes of those events. Event arrival rules may for example dictateidentifying a particular predetermined alert for transmission to asystems administrator in dependence upon a particular event type orcomponent type for the event or other attribute of that event. Suchrules are flexible and may be tailored to a particular distributedcomputing system and its functions.

An alert according to embodiments of the present invention is refinedidentification of an occurrence—such and an error—based upon more thanone event and therefore provides an identification of the occurrence inthe context of its operation in the distributed processing system. Oftenan alert may be a notification of a particular error type of occurrencethat is identified in dependence upon the plurality of events receivedfrom one or more components of the data processing system, such as, forexample, a link failure among a plurality of devices each of which areproducing many events based upon the single link failure, or a powerfailure provoking thousands of events, and so on.

Alerts are often implemented as messages to be sent through a datacommunications network or shared memory. Typical alerts according toembodiments of the present invention have attributes attached to thembased upon the attributes of the events received from which they areidentified.

Events pool operation rules (232) are configurable predetermined rulesfor controlling the operations of the events pool. Such rules includesrules identifying the initial predetermined period of time for eachevents pool, rules dictating the length of time extended to the poolupon the assignment of each new event to the pool, rules dictating theminimum time an event must be in a pool before that event is included ina collection of events when the pool is closed, rules governing theclosing of an events pool, and others as will occur to those of skill inthe art. Such rules are flexible and may be tailored to a particulardistributed computing system and its functions.

Event suppression rules (234) are configurable predetermined rules forsuppressing one or more events in a closed pool of events used inidentifying alerts. That is, often events in the closed events pool maybe duplicate events, redundant events, or otherwise unnecessary orunhelpful events in identifying alerts. Such suppression rules aretypically predetermined to delete, drop, or otherwise ignore thosesuppressed events. Event suppression rules may for example dictate thatmore than a threshold number of events of a particular event type orcomponent type are to be suppressed. Such rules are also flexible andmay be tailored to a particular distributed computing system and itsfunctions.

Events pool closure rules (236) are configurable predetermined rules foridentifying alerts in dependence upon unsuppressed events in the closedevents pool and alerts identified by the event arrival rules. That is,events pool closure rules identify new alerts in dependence upon one ormore or even all of the unsuppressed events in the closed events pool.The events pool closure rules also identify alerts in dependence uponthe alerts identified by the event arrival rules (230) or a combinationof the alerts identified by the event arrival rules (230) and one ormore of the unsuppressed events in the closed events pool.

Event analyzer (208) in the example of FIG. 3 sends all the alerts (214)identified by the event analyzer (208) to an alert analyzer (218). Thealert analyzer of FIG. 3 is a module of automated computing machinerycapable of identifying alerts for transmission from events and otheralerts, identifying additional alerts for transmission, and suppressingunnecessary, irrelevant, or otherwise unwanted or unhelpful alertsidentified by the event analyzer. That is, alert analyzers typicallyreceive alerts and events and produce or forward alerts in dependenceupon those alerts and events. In many embodiments, a plurality of alertanalyzers are implemented in parallel. The alerts (216) in the exampleof FIG. 3 are sent from event analyzer (208) to an alert analyzer (218)through an alerts queue (216).

The alert analyzer (218) of FIG. 3 assigns each of the identified alerts(214) to an alerts pool (224). An alerts pool (224) is a collection ofalerts organized by the time of one or more the events causing the alertto be identified, the time the alert is identified, or other time aswill occur to those of skill in the art. That is, alerts pools are acollection of alerts organized by time. Such alerts pools often providethe ability to analyze a groups alerts identified and included in thealerts pool according to some time. Often such alerts pools are usefulin identifying fewer and more relevant alerts in dependence uponmultiple related events and multiple related alerts.

The alert analyzer administers pools of alerts according to embodimentsof the present invention by receiving, by an alert analyzer from analert queue, a plurality of alerts from one or more components of thedistributed processing system; creating, by the alert analyzer, a poolof alerts, the pool having a predetermined initial period of time;assigning, by the alert analyzer, each received alert to the pool;assigning, by the alert analyzer, to each alert a predetermined minimumtime for inclusion in a pool; extending, by the alert analyzer, for oneor more of the alerts the predetermined initial period of time of thepool by a particular period of time assigned to the alert; determining,by the alert analyzer, whether conditions have been met to close thepool; and if conditions have been met to close the pool, determining foreach alert in the pool whether the alert has been in the pool for itspredetermined minimum time for inclusion in a pool; and if the alert hasbeen in the pool for us predetermined minimum time, including the alertin the closed pool; and if the alert has not been in the pool for itspredetermined minimum time, evicting the alert from the closed pool andincluding the alert in a next pool.

The alert analyzer may assign the identified alerts to an alerts pool(224) in dependence upon attributes of the alerts or attributes of theevents from which those alerts were identified. For example, the alertanalyzer of FIG. 3 may assign alerts to the alerts pool (224) byselecting alerts generated from events from one or more particularcomponents, alerts associated with a particular alert type and so on aswill occur to those of skill in the art.

The alert analyzer (218) of FIG. 3 determines in dependence upon alertanalysis rules (222) and the alerts in the alert pool whether tosuppress any alerts. Suppressing an alert is typically carried out bydropping the alert, deleting the alert or otherwise ignoring or nottransmitting the suppressed alert to a component of the distributedprocessing system.

Alert analyses rules (222) are a collection of rules for suppressing oneor more alerts to provide a more relevant set of alerts for transmissionto a component of the distributed processing system, such as forexample, for display to a systems administrator and to identifyadditional alerts for transmission to one or more components of thedistributed processing system. Alert analysis rules for example maydictate that duplicate alerts are to be suppressed, alerts of aparticular type for transmission to a particular component are to besuppressed, alerts of a particular type be transmitted to a particularcomponent are to be suppressed and so on as will occur to those of skillin the art. Such alerts may be more meaningful to a component of thedistributed processing system for automated error recovery or for asystems administrator who may otherwise be less informed by a number ofraw unanalyzed alerts.

The alert analyzer (218) of FIG. 3 also has access to the events queue(206). The alert analyzer (218) of FIG. 3 in dependence upon the alertanalysis rules may, in some embodiments select events from the eventsqueue and determine whether to suppress any alerts in dependence uponthe selected events. That is, alert analysis rules may also take intoaccount events and their attributes for suppressing alerts and foridentifying additional alerts for transmission to one or morecomponents. Such events may be related to the alerts in the alerts poolor independent from such alerts.

The alert analyzer (218) of FIG. 3 transmits the unsuppressed alerts toone or more components of the distributed processing system. The alertanalyzer may transmit the unsuppressed alerts to one or more componentsof the distributed processing system by sending the alert as a messageacross a data communications network, through shared memory, or in otherways as will occur to those of skill in the art. In the example of FIG.3, the unsuppressed alerts (220) are transmitted to a terminal (122) fordisplay to a systems administrator (128).

The alert analyzer (218) of FIG. 3 is also capable of identifying independence upon alert analysis rules (222), the alerts in the alert pool(224), and selected events (206) one or more additional alerts andtransmitting the one or more components of the distributed processingsystem. The additional alerts may include one or more alerts notidentified by the event analyzer. Such additional alerts may provideadditional information to a component of the distributed processingsystem of a systems administrator.

As mentioned above, relevant alert delivery according to the presentinvention includes assigning events to an event pool and those pools areadministered according to embodiments of the present invention. Forfurther explanation, FIG. 4 sets forth a diagram illustrating assigningevents to an event pool according to embodiments of the presentinvention. An events pool (212) is a collection of events organized bythe time of either their occurrence, by the time they are logged in theevent queue, included in the events pool, or other time as will occur tothose of skill in the art.

That is, event pools are a collection of events organized by time. Suchevents pools often provide the ability to analyze a group of timerelated events and to identify alerts in dependence upon them. Oftensuch event pools are useful in identifying fewer and more relevantalerts in dependence upon multiple related events.

Events pools according to embodiments of the present invention aretypically operated according to events pool operation rules which arethemselves often included in event analysis rules. Such events pooloperation rules are configurable predetermined rules for controlling theoperations of the events pool. Such rules includes rules identifying theinitial predetermined period of time for each events pool, rulesdictating the length of time extended to the pool upon the assignment ofeach new event to the pool, rules dictating the minimum time an eventmust be in a pool before that event is included in a collection ofevents when the pool is closed, rules governing the closing of an eventspool, and others as will occur to those of skill in the art. Such rulesare flexible and may be tailored to a particular distributed computingsystem and its functions.

Events are often assigned to an events pool according to their loggedtime. That is, events are typically inserted into the events pool in theorder that they are received in the event queue. In the example of FIG.4, the timing of the events pool (212) is initiated when the first event‘Event 0’ (400) is assigned to the events pool (212) at time t₀. Theevents pool of FIG. 4 is initiated for a predetermined initial period oftime from t₁ to t_(f). That is, upon receiving the first event ‘Event 0’(400) the events pool of FIG. 4 has a predetermined initial period oftime beginning at t₁ and ending at t_(f). The predetermined initialperiod of time may be configured in dependence upon a number of factorsas will occur to those of skill in the art such as, the number ofcomponents in the distributed processing system, the frequency ofreceiving events, the types of events typically received and so on aswill occur to those of skill in the art.

In the example FIG. 4, the initial period of time is extended for eachnew event assigned to the events pool during the predetermined initialperiod from t₁ to t_(f) by a particular period of time assigned to theevent. In the example of FIG. 4 upon assigning ‘Event 1’ (402) to theevents pool (212) the predetermined initial period of time t₀−t_(f) isextended by ‘Extension 1’ (406) having a time of e1 thereby creating anew time for closing the events pool (212) at t_(f+e1) if no otherevents are assigned to the pool before t_(f+e1). Similarly, in theexample of FIG. 4 upon assigning ‘Event 2’ (404) to the events poolhaving a time of e2, the now extended period of time from t₀−t_(f+e1) isextended again by extension 2 (406) thereby establishing a new time forclosing the pool at time t_(f−e1−e2) if no other events are assigned tothe pool before t_(f+e1+e2) or before some maximum time for the eventspool has expired. In this manner, the event pool is extended with eachreceived event until a collection of events that may be usefully used toidentify alerts is assigned to the events pool.

In typical embodiments of the present invention, event pools may have amaximum duration that can no longer be extended. In such cases, arequirement may exist that an event that has not resided in the eventpool for a threshold period of time be moved to a next events pool. Insome embodiments, the attributes of such an event that is moved to thenext events pool are used for relevant alert delivery according toembodiments of the present invention with the initial events pool and inother embodiments, the attributes of such an event are used for relevantalert delivery with the next events pool to which that event is moved.

In the example of FIG. 4, when conditions are met to close the pool anevents analyzer determines for each event (400, 402, 404) in the pool(212) whether the event has been in the pool for its predeterminedminimum time for inclusion in a pool. If the event has been in the poolfor its predetermined minimum time, the event is included in the closedpool for event analysis for relevant alert delivery according toembodiments of the present invention. If the event has not been in thepool for its predetermined minimum time, the event is evicted from theclosed pool and included a next pool for event analysis for relevantalert delivery according to embodiments of the present invention.

In many embodiments, a plurality of events pools may be used in paralleland one or more of such events pools are assigned to a particular eventsanalyzer. In such embodiments, events analyzers may be directed toevents in events pools having particular attributes.

As mentioned above, relevant alert delivery according to the presentinvention also includes assigning alerts to an alerts pool. For furtherexplanation, FIG. 5 sets forth a diagram illustrating assigning alertsto an alert pool according to embodiments of the present invention. Thealerts pool (224) of FIG. 5 operates in a manner similar to the eventspool of FIG. 4. That is, the alerts pool according to the example ofFIG. 5 includes alerts and the timing of the alerts pool begins with thefirst alert ‘Alert 0’ (500) at time t_(o) and is configured to have apredetermined initial period of time t₀−tf. In the example of FIG. 5,the initial period of time is extended for each new alert assigned tothe alerts pool in the predetermined initial period from t₁ to t_(f) bya particular period of time assigned to the alert. In the example ofFIG. 5, upon assigning ‘Alert 1’ (502) to the alerts pool (224) thepredetermined initial period of time t₀−t_(f) is extended by ‘Extension1’ (506) having a time of e1 thereby creating a new time for closing thealerts pool (224) at t_(f+e1) if no other alerts are assigned to thepool before t_(f+e1). Similarly, in the example of FIG. 4 upon assigning‘Alert 2’ (504) to the alerts pool having a time of e2, the now extendedperiod of time from t₀−t_(f+e1) is extended again by ‘Extension 2’ (406)thereby establishing a new time for closing the pool at time t_(f+e1+e2)if no other alerts are assigned to the pool before t_(f+e1−e2) or beforesome maximum time for the alerts pool has expired.

In typical embodiments of the present invention, alerts pools may have amaximum duration that can no longer be extended. In such cases, arequirement may exist that an alert that has not resided in the alertpool for a threshold period of time be moved to a next alerts pool. Insome embodiments, the attributes of such an alert that is moved to thenext alerts pool are used for relevant alert delivery according toembodiments of the present invention with the initial alerts pool and inother embodiments, the attributes of such an alert are used for relevantalert delivery with the next alerts pool to which that alert is moved.

In the example of FIG. 5, when conditions are met to close the pool analerts analyzer determines for each alert (500, 502, 504) in the pool(224) whether the alert has been in the pool for its predeterminedminimum time for inclusion in a pool. If the alert has been in the poolfor its predetermined minimum time, the alert is included in the closedpool for alert analysis for relevant alert delivery according toembodiments of the present invention. If the alert has not been in thepool for its predetermined minimum time, the alert is evicted from theclosed pool and included a next pool for alert analysis for relevantalert delivery according to embodiments of the present invention.

In many embodiments, a plurality of alerts pools may be used in paralleland one or more of such alerts pools are assigned to a particular alertsanalyzer. In such embodiments, alerts analyzers may be directed toalerts in alerts pools having particular attributes.

For further explanation, FIG. 6 sets forth a flow chart illustrating anexample method of administering event pools for relevant alert analysisin a distributed processing system according to embodiments of thepresent invention. The method of FIG. 6 includes receiving (402) in anevent queue a plurality of events (202) from one or more components of adistributed processing system. Events useful in relevant alert deliverywith event and alert suppression according to embodiments of the presentinvention may include an occurred time, a logged time, an event type, anevent ID, a reporting component, and a source component.

Receiving (402) in an event queue a plurality of events (202) from oneor more components of a distributed processing system may be carried outby receiving an event initiated by one or more components of the dataprocessing system and storing the event in the event queue according tothe time in which the event occurred or according to the time the eventwas received. Receiving (402) in an event queue a plurality of events(202) from one or more components of a distributed processing systemalso may be carried out by polling a component for status and receivingin response an event and storing the event in the event queue accordingto the time in which the event occurred or according to the time theevent was received.

The method of FIG. 6 also includes assigning (404) by an event analyzereach received event to an events pool (212). In some embodiments of thepresent invention, assigning (404) by an event analyzer each receivedevent (202) to an events pool (212) may be carried out by assigningevents to the event pool according to the logged time. Assigning (404)by an event analyzer each received event (202) to an events pool (212)may also be carried out in dependence upon attributes of the event. Suchattributes may include an identification or type of the component uponwhich an occurrence occurred to create the event, the reportingcomponent of the event, the event ID, the event type, and so on as willoccur to those of skill in the art.

An events pool according to the method of FIG. 6 includes eventsoccurring during a predetermined initial period of time and in theexample of FIG. 6 assigning (404) by the event analyzer each receivedevent to an events pool includes extending (426) for each event assignedto the events pool the predetermined initial period of time by aparticular period of time assigned to the event.

The event analyzer includes event analysis rules (210) including, eventarrival rules, events pool operation rules, event suppression rules, andevents pool closure rules. Event arrival rules are configurablepredetermined rules for identifying alerts in dependence upon events inreal time as those events are assigned to the events pool. That is,event arrival rules identify alerts in dependence upon events beforeclosing the events pool. Such rules are flexible and may be tailored toa particular distributed computing system and its functions.

An alert according to embodiments of the present invention is refinedidentification of an occurrence—such and an error—based upon more thanone event and therefore provides an identification of the occurrence inthe context of its operation in the distributed processing system. Oftenan alert may be a notification of a particular error type of occurrencethat is identified in dependence upon the plurality of events receivedfrom one or more components of the data processing system, such as, forexample, a link failure among a plurality of devices each of which areproducing many events based upon the single link failure, or a powerfailure provoking thousands of events, and so on.

Alerts are often implemented as messages to be sent through a datacommunications network or shared memory. Typical alerts according toembodiments of the present invention have attributes attached to thembased upon the attributes of the events received from which they areidentified.

Events pool operation rules are configurable predetermined rules forcontrolling the operations of the events pool. Such rules includes rulesidentifying the initial predetermined period of time for each eventspool, rules dictating the length of time extended to the pool upon theassignment of each new event to the pool, rules dictating the minimumtime an event must be in a pool before that event is included in acollection of events when the pool is closed, rules governing theclosing of an events pool, and others as will occur to those of skill inthe art. Such rules are flexible and may be tailored to a particulardistributed computing system and its functions.

Event suppression rules are configurable predetermined rules forsuppressing one or more events in a closed pool of events used inidentifying alerts. That is, often events in the closed events pool maybe duplicate events, redundant events, or otherwise unnecessary orunhelpful events in identifying alerts. Such suppression rules aretypically predetermined to delete, drop, or otherwise ignore thosesuppressed events. Event suppression rules may for example dictate thatmore than a threshold number of events of a particular event type orcomponent type are to be suppressed. Such rules are also flexible andmay be tailored to a particular distributed computing system and itsfunctions.

Events pool closure rules are configurable predetermined rules foridentifying alerts in dependence upon unsuppressed events in the closedevents pool and alerts identified by the event arrival rules. That is,events pool closure rules identify new alerts in dependence upon one ormore or even all of the unsuppressed events in the closed events pool.The events pool closure rules also identify alerts in dependence uponthe alerts identified by the event arrival rules or a combination of thealerts identified by the event arrival rules and one or more of theunsuppressed events in the closed events pool.

The method of FIG. 6 also includes identifying (410) by the eventanalyzer in dependence upon the event arrival rules and the eventsassigned to the events pool one or more alerts (214). Identifying (410)by the event analyzer in dependence upon the event arrival rules and theevents assigned to the events pool one or more alerts (214) may becarried out by identifying alerts in dependence upon one or moreattributes of the events as that event is assigned to the events pool.Identifying (410) by the event analyzer in dependence upon the eventarrival rules and the events assigned to the events pool one or morealerts (214) may be carried by comparing the attributes of the events tothe event arrival rules and identifying as a result of the comparisonone or more alerts. Such attributes may include the type of componentfrom which the event was received, the type of component creating theevent, the identification of the component creating the event, the timethe event was created or received, an error reported in the event, andmany others as will occur to those of skill in the art.

The method of FIG. 6 also includes closing (412), by the event analyzerin dependence upon the events pool operation rules, the events pool(212). Closing (412), by the event analyzer in dependence upon theevents pool operation rules, the events pool (212) may be carried out bydetermining that conditions dictated by the events pool operation ruleshave been met to stop assigning new events to the events pool andidentifying in dependence upon those events pool operation rules theparticular events that are included in the closed pool of events.

Closing the events pool may be carried out by determining that theinitial period of time for the events pool and any particular periods oftime for events received in the events pool extended to the initialperiod of time have expired. In such cases, if no new events arereceived prior to the expiration of the initial period of time for theevents pool and any particular periods of time for events received inthe events pool extended to the initial period of time the pool isclosed.

Closing the events pool may also be carried out by determining that amaximum duration for the events pool has expired. In such cases,regardless of the number of new events being received after a maximumduration for the events pool has expired the pool is closed. In suchembodiments, a maximum duration for the events pool prevents the eventspool from including more events than are useful for relevant alertdelivery according to embodiments of the present invention.

The method of FIG. 6 also includes determining (414), by the eventsanalyzer in dependence upon the event suppression rules, whether tosuppress one or more events in the closed events pool (212). Determining(414), by the events analyzer in dependence upon the event suppressionrules, whether to suppress one or more events in the closed events pool(212) may be carried out by determining in dependence upon theattributes of one or more events in the closed pool whether to delete,drop, or otherwise ignore one or more of the events in the closed pool.

The method of FIG. 6 includes identifying (416) by the event analyzer independence upon the events pool closure rules and any unsuppressedevents assigned to the events pool, one or more additional alerts (417).Identifying (416) by the event analyzer in dependence upon the eventspool closure rules and any unsuppressed events assigned to the eventspool, one or more additional alerts (417) may be carried out byidentifying alerts in dependence upon one or more attributes of theevents as that event is assigned to the events pool. Identifying (416)by the event analyzer in dependence upon the events pool closure rulesand any unsuppressed events assigned to the events pool, one or moreadditional alerts (417) may be carried out by selecting the unsuppressedevents for the events pool, comparing the attributes of the unsuppressedevents of the events pool to the pool closure rules, and identifying asa result of the comparison one or more additional alerts. Suchattributes may include the type of component from which one or more ofthe unsuppressed events are received, the type of components creatingthe unsuppressed events, the identification of the component creatingthe unsuppressed events, the time the events were created or received,one or more errors reported by the events event, the number of events inthe pool, and many others as will occur to those of skill in the art.

The method of FIG. 6 includes sending (418) by the event analyzer to analert analyzer all the alerts identified by the event analyzer. Sending(418) by the event analyzer to an alert analyzer all the alerts (214)identified by the event analyzer may be carried out by sending a messagecontaining the alerts from the event analyzer to the alert analyzer.Such a message may be sent from the event analyzer to the alert analyzeracross a network, through shared memory, or in other ways as will occurto those of skill in the art.

The method of FIG. 6 includes assigning (420) by the alert analyzer theidentified alerts to an alerts pool (224). An alerts pool according tothe method of FIG. 6 has a predetermined initial period of time and inthe example of FIG. 6 assigning (420) by the alert analyzer theidentified alerts to an alerts pool (224) includes extending for eachalert assigned to the alerts pool the predetermined initial period oftime by a particular period of time assigned to the alert. Assigning(420) by the alert analyzer the identified alerts to an alerts pool(224) also may be carried out in dependence upon attributes of thealerts. Such attributes may include an identification or type of thecomponent upon which an occurrence occurred to create the event that wasused to identify the alert, the alert ID, the alert type, and so on aswill occur to those of skill in the art.

The method of FIG. 6 includes determining (422) by the alert analyzer independence upon alert analysis rules (222) and the alerts in the alertpool whether to suppress any alerts. Determining (422) by the alertanalyzer in dependence upon alert analysis rules (222) and the alerts inthe alert pool whether to suppress any alerts may be carried out independence upon one or more attributes of the alerts. Such attributesmay include an identification or type of the component upon which anoccurrence occurred to create the event that was used to identify thealert, the alert ID, the alert type, and so on as will occur to those ofskill in the art. In such embodiments, determining (422) by the alertanalyzer in dependence upon alert analysis rules (222) and the alerts inthe alert pool whether to suppress any alerts may be carried out bycomparing the attributes of the alerts in the alerts pool to the alertanalysis rules and identifying as a result of the comparison one or morealerts for suppression according to the event analysis rules.

The method of FIG. 6 includes transmitting (420) the unsuppressed alertsto one or more components of the distributed processing system.Transmitting (420) the unsuppressed alerts to one or more components ofthe distributed processing system may be carried out by sending amessage containing the alert to one or more components of thedistributed processing system. In many cases, an alert may be sent as amessage to a systems administrator advising the systems administrator ofone or more occurrences within the distributed processing system.

As mentioned above, alert analysis rules may select additional alerts orsuppress alerts in dependence upon events. In such embodiments,determining whether to suppress any alerts includes selecting events anddetermining whether to suppress any alerts in dependence upon theselected events. The method of FIG. 6 therefore also includesidentifying (426) by the alert analyzer in dependence upon alertanalysis rules (222), the alerts in the alert pool (224), and anyselected events one or more additional alerts and in the method of FIG.6, transmitting (428) the unsuppressed alerts also includes transmitting(430) any additional alerts to one or more components of the distributedprocessing system.

As mentioned above, relevant alert delivery according to embodiments ofthe present invention includes the administration of one or more poolsof incidents such as events, alerts or other incidents as will occur tothose of skill in the art. For further explanation, FIG. 7 sets forth aflow chart illustrating an exemplary method of configurable alertdelivery in a distributed processing system according to embodiments ofthe present invention. The method of FIG. 7 includes generating (702),by the alert analyzer (218), a plurality of alerts (202). Generating(702) a plurality of alerts (202) may be carried out by comparing theattributes of events to the event arrival rules and identifying as aresult of the comparison one or more alerts. Such attributes may includethe type of component from which the event was received, the type ofcomponent creating the event, the identification of the componentcreating the event, the time the event was created or received, an errorreported in the event, and many others as will occur to those of skillin the art.

The method of FIG. 7 also includes for each alert, applying (704), bythe alert analyzer (218), active alert filters (790) to the alert.Applying (704) active alert filters (790) to the alert may be carriedout by determining which alerts will be distributed to which activelisteners. In the method of FIG. 7, applying (704) active alert filters(790) to the alert includes creating (706), by the alert analyzer (218),a list (750) of all active alert filters (790). Creating (706) a list(750) of all active alert filters (790) may be carried out byidentifying all alert filters that are currently running; classifyingthe identified alert filters as active alert filters; and copyingidentifications of the active alert filters to a list. The alertanalyzer (218) may create an alert specific list of the active alertfilters for each alert. That is, each alert will have an independentlist of the active alert filters. Filters may perform a variety of tasksincluding checking for duplicate alerts to prevent a listener fromreporting the same alert multiple times when an event or alert thatfails is retired and checking the source of an alert to prevent alertsfrom some components of the system to be blocked or permitted. A usermay provide user defined parameters for one or more of the filters.

In the method of FIG. 7, applying (704) active alert filters (790) tothe alert includes creating (752), by the alert analyzer (218), a set(752) of all active listeners (792). Creating (752) a set (752) of allactive listeners (792) may be carried out by identifying all listenersthat are currently running; classifying the identified listeners asactive listeners; and copying identifications of the active listeners toa set. A listener reports the alerts to components of the system outsideof the alert analyzer (218). Listeners are configured to report thealerts to different components of the system. Listeners may performtasks such as sending emails, sending files, sending to an externalconsole or application, or reporting to a subsystem. An active listeneris a listener that is currently running within the alert analyzer (218).

In the method of FIG. 7, applying (704) active alert filters (790) tothe alert includes associating (710), by the alert analyzer (218), witheach active listener (792) one or more active alert filters (790) fromthe list (750) of active alert filters. Associating (710) with eachactive listener (792) one or more active alert filters (790) from thelist (750) of active alert filters may be carried out by retrieving aconfiguration file that specifies the relationships between the filtersand the listeners. In the configuration file, the active alert filtersmay be specified as local or global filters. Global alert filters arealways run, unless overwritten and local alert filters are only run forthe listeners that specify them. The configuration file indicates ifglobal filters should be run or not and provides a list of filters thatmust be run before a particular listener is called.

In the method of FIG. 7, applying (704) active alert filters (790) tothe alert includes for each active alert filter, running (712), by thealert analyzer (218), the active alert filter. Running (712) the activealert filter may be carried out by executing the alert filter accordingto the configuration of the alert filter.

In the method of FIG. 7, applying (704) active alert filters (790) tothe alert includes if the active alert filter indicates that the alertshould not go to one or more of the active listeners (792), removing(714), by the alert analyzer (218), the one or more active listenersfrom the set (752) of all active listeners. Removing (714) the one ormore active listeners from the set (752) of all active listeners may becarried out by deleting from the set of all active listeners the one ormore active listeners. That is, each alert has a specific set of activelisteners and removing one active listener from one list does not removethe same active listener from another list corresponding to anotheralert.

In the method of FIG. 7, applying (704) active alert filters (790) tothe alert includes determining (716), by the alert analyzer (218), ifthe filter is the last filter on the active alert filter list (750).Determining (716) if the filter is the last filter on the active alertfilter list (750) may be carried out by tracking which filters on thelist of active filters for a particular alert have been analyzed; and ifeach filter has been analyzed, determining that the filter is the lastfilter on the list.

The method of FIG. 7 includes if the filter is the last active alertfilter on the active alert filter list (750), for each alert, calling(724), by the alert analyzer (218), each active listener remaining inthe set (752) of active listeners. Calling (724) each active listenerremaining in the set (752) of active listeners may be carried out bytransmitting a specific alert to a listener.

In the method of FIG. 7, applying (704) active alert filters (790) tothe alert includes if the filter is not the last active alert filter onthe active alert filter list (750), determining (718), by the alertanalyzer (218), if the active listeners set (752) is empty. Determining(718) if the active listeners set (752) is empty may be carried out bydetermining if all of the active listeners in the set of activelisteners have been removed.

In the method of FIG. 7, applying (704) active alert filters (790) tothe alert includes if the active listeners set (752) is empty, stopping(722), by the alert analyzer (218), processing of the alert. Stopping(722) processing of the alert may be carried out by deleting, removing,or otherwise preventing the alert from being distributed to the activelisteners.

In the method of FIG. 7, applying (704) active alert filters (790) tothe alert includes if the active listeners set (752) is not empty,selecting (720), by the alert analyzer (218), a next active alert filterfrom the active alert filter list (750). Selecting (720) a next activealert filter from the active alert filter list (750) may be carried outby tracking which active alert filters have been analyzed; and selectingan active alert filter that has not been analyzed.

For further explanation, FIG. 8 sets forth a flow chart illustrating anadditional method of applying (704), by the alert analyzer (218), theactive alert filter to the alert. In the method of FIG. 8, applying(704), by the alert analyzer (218), active alert filter to the alertincludes maintaining (802), by the alert analyzer (218), a count (850)of active listeners that use the active alert filter. Maintaining (802)a count (850) of active listeners that use the active alert filter maybe carried out by tracking the number of active listeners correspondingto the particular active alert filter; and storing data as the countthat indicates the number of active listeners corresponding to theparticular active alert filter.

In the method of FIG. 8, applying (704), by the alert analyzer (218),active alert filter to the alert includes for each one of the one ormore active listeners removed from the active alert filter list (750)for that filter, decrementing (804), by the alert analyzer (218), thecount (850) for the active alert filter. Decrementing (804) the count(850) for the active alert filter may be carried out by removing onefrom the count.

In the method of FIG. 8, applying (704), by the alert analyzer (218),active alert filter to the alert includes determining (806), by thealert analyzer (218), whether any of the active alert filter counts arezero. Determining (806) whether any of the active alert filter countsare zero may be carried out by comparing the counts associated with thefilters; identifying if all of the active listeners associated with theparticular filter have been removed.

In the method of FIG. 8, applying (704), by the alert analyzer (218),active alert filter to the alert includes if an active alert filtercount is zero, removing (808), by the alert analyzer (218), the activealert filter from the active alert filter list (750). Removing (808) theactive alert filter from the active alert filter list (750) may becarried out by deleting the active alert filter from the active alertfilter list such that the particular active alert filter is not furtheranalyzed. That is, each alert has a specific set of active filters andremoving one active filter from one list does not remove the same activefilter from another list corresponding to another alert.

In the method of FIG. 8, applying (704), by the alert analyzer (218),active alert filter to the alert includes if an active alert filtercount is not zero, selecting (720), by the alert analyzer (218), a nextactive alert filter from the active alert filter list (750). Selecting(720) a next active alert filter from the active alert filter list (750)may be carried out by tracking which active alert filters have beenanalyzed; and selecting an active alert filter that has not beenanalyzed.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

It will be understood from the foregoing description that modificationsand changes may be made in various embodiments of the present inventionwithout departing from its true spirit. The descriptions in thisspecification are for purposes of illustration only and are not to beconstrued in a limiting sense. The scope of the present invention islimited only by the language of the following claims.

1. A method of configurable alert delivery in a distributed processing system, the method comprising: for each alert generated by an incident analyzer, applying, by the incident analyzer, active alert filters to the alert; wherein applying the active alert filters to the alert includes: creating, by the incident analyzer, a list of all active alert filters and a set of all active listeners; and for each active alert filter, running, by the incident analyzer, the active alert filter; if the active alert filter indicates that the alert should not go to one or more of the active listeners, removing, by the incident analyzer, the one or more active listeners from the set of all active listeners; if the active listeners set is empty, stopping, by the incident analyzer, processing of the alert; and if the active listeners set is not empty, selecting, by the incident analyzer, the next active alert filter from the active alert filter list.
 2. The method of claim 1 further comprising for each active alert filter: maintaining, by the incident analyzer, a count of active listeners that use the active alert filter; for each one of the one or more active listeners removed from the active alert filter list for that filter, decrementing, by the incident analyzer, the count for the active alert filter; determining, by the incident analyzer, whether any of the active alert filter counts are zero; and if an active alert filter count is zero, removing, by the incident analyzer, the active alert filter from the active alert filter list.
 3. The method of claim 1, wherein the active listeners removed from the active alert listener list are prevented from receiving the alert.
 4. The method of claim 1 further comprising for each alert, calling with the alert, by the incident analyzer, each active listener remaining in the set of active listeners.
 5. The method of claim 1, wherein at least one of the active alert filters on the active alert filter list is user defined.
 6. The method of claim 1, wherein at least one of the active listeners is user defined.
 7. A system for configurable alert delivery in a distributed processing system, the system comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions capable, when executed by the computer processor, of causing the system to carry out the steps of: for each alert generated by an incident analyzer, applying, by the incident analyzer, active alert filters to the alert; wherein applying the active alert filters to the alert includes: creating, by the incident analyzer, a list of all active alert filters and a set of all active listeners; and for each active alert filter, running, by the incident analyzer, the active alert filter; if the active alert filter indicates that the alert should not go to one or more of the active listeners, removing, by the incident analyzer, the one or more active listeners from the set of all active listeners; if the active listeners set is empty, stopping, by the incident analyzer, processing of the alert; and if the active listeners set is not empty, selecting, by the incident analyzer, the next active alert filter from the active alert filter list.
 8. The system of claim 7 further comprising for each active alert filter: maintaining, by the incident analyzer, a count of active listeners that use the active alert filter; for each one of the one or more active listeners removed from the active alert filter list for that filter, decrementing, by the incident analyzer, the count for the active alert filter; determining, by the incident analyzer, whether any of the active alert filter counts are zero; and if an active alert filter count is zero, removing, by the incident analyzer, the active alert filter from the active alert filter list.
 9. The system of claim 7, wherein the active listeners removed from the active alert listener list are prevented from receiving the alert.
 10. The system of claim 7 further comprising for each alert, calling with the alert, by the incident analyzer, each active listener remaining in the set of active listeners.
 11. The system of claim 7, wherein at least one of the active alert filters on the active alert filter list is user defined.
 12. The system of claim 7, wherein at least one of the active listeners is user defined.
 13. A computer program product for configurable alert delivery in a distributed processing system, the computer program product disposed upon a computer readable storage medium, the computer program product comprising computer program instructions for: for each alert generated by an incident analyzer, applying, by the incident analyzer, active alert filters to the alert; wherein applying the active alert filters to the alert includes: creating, by the incident analyzer, a list of all active alert filters and a set of all active listeners; and for each active alert filter, running, by the incident analyzer, the active alert filter; if the active alert filter indicates that the alert should not go to one or more of the active listeners, removing, by the incident analyzer, the one or more active listeners from the set of all active listeners; if the active listeners set is empty, stopping, by the incident analyzer, processing of the alert; and if the active listeners set is not empty, selecting, by the incident analyzer, the next active alert filter from the active alert filter list.
 14. The computer program product of claim 13 further comprising for each active alert filter: maintaining, by the incident analyzer, a count of active listeners that use the active alert filter; for each one of the one or more active listeners removed from the active alert filter list for that filter, decrementing, by the incident analyzer, the count for the active alert filter; determining, by the incident analyzer, whether any of the active alert filter counts are zero; and if an active alert filter count is zero, removing, by the incident analyzer, the active alert filter from the active alert filter list.
 15. The computer program product of claim 13, wherein the active listeners removed from the active alert listener list are prevented from receiving the alert.
 16. The computer program product of claim 13 further comprising for each alert, calling with the alert, by the incident analyzer, each active listener remaining in the set of active listeners.
 17. The computer program product of claim 13, wherein at least one of the active alert filters on the active alert filter list is user defined.
 18. The computer program product of claim 13, wherein at least one of the active listeners is user defined. 